Stopping time of a one-dimensional bounded quantum walk
Luo Hao1, Zhan Xiang2, Zhang Peng1, Xue Peng2, †,
Department of Physics, Renmin University of China, Beijing 100872, China
Department of Physics, Southeast University, Nanjing 211189, China

 

† Corresponding author. E-mail: gnep.eux@gmail.com

Project supported by the National Natural Science Foundation of China (Grant Nos. 11222430, 11434011, and 11474049), the National Basic Research Program of China (Grant No. 2012CB922104), the Fundamental Research Funds for the Central Universities, China, and the Research Funds of Renmin University of China (Grant No. 16XNLQ03).

Abstract
Abstract

The stopping time of a one-dimensional bounded classical random walk (RW) is defined as the number of steps taken by a random walker to arrive at a fixed boundary for the first time. A quantum walk (QW) is a non-trivial generalization of RW, and has attracted a great deal of interest from researchers working in quantum physics and quantum information. In this paper, we develop a method to calculate the stopping time for a one-dimensional QW. Using our method, we further compare the properties of stopping time for QW and RW. We find that the mean value of the stopping time is the same for both of these problems. However, for short times, the probability for a walker performing a QW to arrive at the boundary is larger than that for a RW. This means that, although the mean stopping time of a quantum and classical walker are the same, the quantum walker has a greater probability of arriving at the boundary earlier than the classical walker.

1. Introduction

The random walk (RW) has been an important mathematical problem in probability theory and stochastic processes.[1] The quantum walk (QW)[2] is a nontrivial extension of the classical RW, in which the walker obeys quantum mechanical rules. Because of quantum interference effects, the properties of QW are significantly different from those of RW.[3]

A motivation for the study on QW is to develop new quantum algorithms, which provide exponential speed-ups[410] when compared with classical algorithms. In addition, QW is a valuable model for studying physical processes of several important quantum protocols.[1124] QW has been realized in kinds of experiments involving linear optical systems,[2531] cold atoms on an optical lattice,[32] trapped ions,[33,34] nuclear magnetic resonance techniques,[35,36] optical waveguides,[37] and optical fiber networks.[38] Moreover, recent researches proposed schemes to realize QW with quantum dots system.[39,40]

In previous work, the research on QW has mainly focused on the probability distribution of the position of a quantum walker after a fixed number of steps.[1124] In RW theory, there is another important concept called stopping time.[41] The stopping time is defined as the number of steps at which a random walker arrives at a fixed boundary for the first time. For a RW with given boundaries, the stopping time is a random variable, and the corresponding mean value and probability distribution have been studied by many authors. The results are shown to be useful. For instance, they can be used to solve the Gambler’s Ruin problem.[42] Nevertheless, the stopping time of a QW has not been studied before.

In this paper, we develop a method to calculate the probability distribution of the stopping time for a discrete-time one-dimensional bounded QW. With our method, we calculate the probability distribution and the mean value of the stopping time and moreover compare the properties of stopping time for QW and RW. We show that their mean values for the stopping time are the same. However, the probability distributions associated with the stopping time are quite different for these two problems. In particular, over short-time intervals, the probability density of the stopping time of a QW is larger than that for a RW. This means that a quantum walker has a greater probability of arriving at boundary earlier than a classical walker. Our result is also illustrated via the analysis of the commutative probability of a QW and a RW.

The remainder of this paper is organized as follows. In Section 1, we briefly introduce the definition and properties of the stopping time of a RW. In Section 3, we show our method for the calculation of the probability distribution of the stopping time for a QW. In Section 4, we use our method to compare the properties of the stopping time for QW and RW. There is a brief summary in Section 5.

2. Stopping time of a RW
2.1. Classical random walk

To introduce the definition and mathematical properties of a discrete-time one-dimensional RW, we consider a walker starting from the origin. In the RW, in each step the walker flips an unbiased coin and moves to the right (left) if the coin shows a head (tail). After t steps, the position x of the walker is a random variable, and satisfies the binomial distribution

Here, x takes discrete values 0,±1,±2,…

2.2. Stopping time of a RW

Now, we introduce the definition of stopping time of a RW. We consider a RW in which the walker starts from the origin x = 0. We assume that there is a pair of dam-boards (i.e., boundary) at positions x = ±Xd, and the RW terminates immediately when the walker arrives at one of these dam-boards (Fig. 1). The time Ts at which the process terminates, i.e., the time when the walker arrives at x = Xd or x = −Xd, is defined as the stopping time of RW.

Fig. 1. Bounded discrete-time one-dimensional RW. The walker starts from position 0 and moves to the right or left in each step. The process stops the moment the walker arrives at one of two dam-boards at positions x = ±Xd. In this problem, the stopping time is a random variable.

The stopping time Ts defined above is clearly a random variable; its distribution depends on the position Xd of the dam-boards, and can be denoted as P(Xd)(Ts). Accordingly, the mean value of the stopping time is also a function of Xd, here denoted as

An analytical proof[42] showed that for a RW, we have

3. Stopping time of a QW
3.1. Quantum walk

We now introduce the QW, in which both walker and coin are quantum systems. The total Hilbert space is 𝓗 = 𝓗w ⊗ 𝓗c, where 𝓗w and 𝓗c are the Hilbert spaces for the walker and coin, respectively. Here, 𝓗w is spanned by position eigen-states |xw (x = 0,±1,±2,…) of the walker, and 𝓗c is spanned by “spin” states |Hc and |Tc, representing the head and tail, respectively, of the coin.

In the beginning of a QW, the walker is at the origin and the coin is prepared in a superposition of head and tail. Specifically, the initial state is

In the first step, the coin is first operated by a Hadamard gate

and then the system is operated by a “conditional-shift transformation”

The physical meaning of US is that the walker moves to the right if the coin shows a head, and moves to the left if the coin shows a tail. Thus, after the first step, the state of the total system is

Similarly, after t steps, the total system is in the state

In this QW process, the walker and coin are entangled. Because of quantum interference effects, which can be constructive or destructive, the probability distribution of the walker’s position is completely different from that for RW (Eq. (1)). The properties of this distribution were discussed in Refs. [3], [11], [41] and [43].

It is pointed out that, the QW can be reduced to a classical RW under the decoherence operation in each step.[44] For our system, we can obtain the results of RW via replacing Eqs. (7) and (8) with and , respectively. Here, ρ(t) is the density operator of the walker and the coin, ρ(0) = |Ψ0〉〈Ψ0|, and the decoherence operator 𝓓 is defined as follows: in the bases {|x〉}, all the non-diagonal elements of 𝓓[ρ] are zero, while the diagonal elements of 𝓓[ρ] are the same as the ones of ρ.

3.2. Stopping time of a QW

Next, we introduce our method for the calculation of the probability distribution of the stopping time of a QW, i.e., the probability distribution for the number of steps Ts at which the walker arrives at the dam-board at x = ±Xd (Xd > 0) for the first time. This probability distribution can be denoted as P(Xd)(Ts) and can be calculated as follows.

Given the above method, we calculated the probability P(Xd)(Ts) numerically. Because this QW is bounded between –Xd and Xd, the dimension of the Hilbert space for the walker’s spatial position is 2Xd + 1; similarly, the dimension for the coin’s spin space is 2. Therefore, the density matrix of the system is a matrix (4Xd + 2) × (4Xd + 2) for the entire process. Theoretically, the random variable t extends to infinity and therefore this evolution is capable of working out all probabilities P(t) (Fig. 2). The truncation time is chosen as , which is large enough for the precision of E(Xd)[Ts]. Through this calculation and a sufficiently large truncation time, the mean value of the stopping time of QW can be obtained.

Fig. 2. P(Xd)(Ts) for QW ((a) and (c)) and RW ((b) and (d)) with Xd = 10 ((a) and (b)) and Xd = 40 ((c) and (d)). Because Xd is even in our cases, we have P(Xd)(Ts) = 0 for odd steps Ts = ±1, ±3, ±5, …. Hence, we have only shown P(Xd)(Ts) for Ts = 0, ±2, ±4, ….
4. Comparison of QW and RW
4.1. Mean value and probability distribution

With the method developed above, we numerically calculate the probability distribution of the stopping time Ts for many discrete-time one-dimensional QWs with different positions Xd of the dam-boards. With our result, we further derive the mean E(Xd)[Ts] of Ts. We find that for fixed values of Xd, the mean value of the stopping time of a QW and a RW are same. Specifically, for a QW we also have . We illustrate this result in Fig. 3.

Fig. 3. Mean value E(Xd)[Ts] of the stopping time of a discrete-time one-dimensional QW. The red solid line is the result ; the black line is the numerical result for a QW, which is given by the method in Section 3.2.

Although the mean value of the stopping time Ts for both QW and RW are the same, the probability distribution of Ts for these two cases are completely different. Figure 2 illustrates the probability distribution P(Xd)(Ts) corresponding to Xd = 10 and Xd = 40, for both QW and RW. We find that for a given value of Xd, P(Xd)(Ts) for a QW peaks at a smaller Ts, and has a larger peak value. That is, if we define Tmax as the value of Ts at which the probability density P(Xd)(Ts) takes its maximum value, and define Pmax as the corresponding peak value (i.e., PmaxP(Xd)(Tmax)), then QW has a smaller Tmax and a larger Pmax. For instance, as shown in Fig. 2, when Xd = 40, for QW we have Tmax = 60 and Pmax = 0.1087, whereas for RW we have Tmax = 532 and Pmax = 1.157 × 10−3.

Our numerical calculations show that this character is universal for QW for different values of Xd. From Fig. 4, when Xd is large (larger than 10), we have and for QW and and for RW. Therefore, we know that as Xd increases, the disparity in stopping times for QW and RW increases.

Fig. 4. (a) Time Tmax for the maximum point in the probability distribution P(Xd)(Ts); (b) the peak value Pmax of P(Xd)(Ts) at time Tmax.

In addition to the above features, our calculation also shows that when Ts is large, the decay of P(Xd)(Ts) for QW is slower than that for RW (Fig. 5). This explains the fact that although the probability distribution P(Xd)(Ts) peaks at a shorter time for QW, the mean of the stopping time Ts is the same for both QW and RW.

Fig. 5. Probability distribution P(Xd)(Ts) for QW and RW of Xd = 10 in the large-Ts region.
4.2. The probability that “QW is faster”

In the section above, we showed that in comparison with a RW, the probability distribution P(Xd)(Ts) of the stopping time for a QW peaks at smaller values of Ts, and has a larger peak value Pmax. This property implies that for a given value of Xd, the walker of a QW has a large probability (more than 50%) of arriving at the dam-boards earlier than a walker of a RW. That is, we have a large probability for the fact that “QW is faster”.

To verify this result, we numerically calculated the probability Q(Xd) for the fact that “QW is faster”. This probability can be reasonably defined as

Here, and are the probability distributions P(Xd)(Ts) of the stopping time for a QW and RW, respectively, and the θ-function is the Heaviside function, defined as θ(x) = 1 for x > 0 and θ(x) = 0 for x ≤ 0. In Fig. 6, we show Q(Xd) for Xd ∈ (10,50). Clearly, in all of these cases we have Q(Xd) > 50%, and Q(Xd) increases with Xd. Hence, we know that because of the difference in probability distribution P(Xd)(Ts) of the stopping time for QW and RW, the walker in a QW has a greater probability Q(Xd) of arriving at the dam-boards earlier than the walker of a RW, and this probability increases with distance Xd between the dam-boards and the starting point of the walker. This is also consistent with our previous result that the difference between P(Xd)(Ts) for QW and RW increases with Xd.

Fig. 6. Probability Q(Xd) that a walker arrives faster by a QW than by a RW.
4.3. Cumulative probability

Finally, we study the cumulative probability for a QW, which is defined as the probability that the walker arrives at the dam-boards before time T. Denoted as F(Xd)(T), we can express it as

Clearly, we have

In Fig. 7, we show the cumulative probability F(Xd)(T) for both QW and RW with Xd = 40. For a QW, the cumulative probability increases very fast for small T. As a result, for short times T, a walker of a QW has a larger probability of arriving at the dam-boards than a walker of the RW. The reason is that the probability distribution P(Xd)(Ts) peaks at a shorter time and has a larger peak value for a QW, as demonstrated in Section 4.1.

Fig. 7. Cumulative probability F(Xd)(T) for QW and RW with Xd = 40.

Figure 7 also shows that when time T is increased, the cumulative probability F(Xd)(T) of a RW can exceed that for a QW. As a result, when T is sufficiently large, the cumulative probability for a RW is larger than that for a QW. This is consistent with the fact that the mean of the stopping time is the same for both QW and RW.

5. Summary

We have developed a method to calculate the probability distribution of the stopping time of a QW. With this method, we further studied the properties of this probability distribution and its mean value. We find that the mean value of the stopping time for QW and RW are the same. However, the distribution of QW and RW are quite different. For QW, the probability for short stopping times is significantly larger than that for RW, and the difference between the distribution of QW and RW increases with distance Xd between the dam-boards and the starting point of the walker. Our result implies that the walker in a QW has a large probability (more than 50%) of arriving at the boundary earlier than the walker of a RW. We also illustrated our result with the analysis for the cumulative probability for a QW and a RW. Our results, which show that a quantum walker has a very large probability to be faster than a classical walker, may be used in quantum search problems. In addition, with our result one can also further study the quantum version of classical problems related to stopping time, such as the Gambler’s ruin problem.

Reference
1Pearson K1905Nature72294
2Aharonov YDavidovich LZagury N 1993 Phys. Rev. 48 1687
3Kempe J 2003 Contemp. Phys. 44 307
4Shenvi NKempe JWhaley K B 2003 Phys. Rev. 67 052307
5Ambainis A 2003 Int. J. Quantum Inf. 1 507
6Kendon V 2006 Phil. Trans. R. Soc. 364 3407
7Childs A MCleve RDeotto EFarhi EGutmann SSpielman D A2003Proceedings of the thirty-fifth Annual ACM Symposium on Theory of Computing (STOC’03)New York, USA354
8Kempe J2003Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM’03)Princeton, New York, USA354
9Ambainis AKempe JRivosh A2005Proceedings of 16th ACM-SIAM Symposium on Discrete Algorithms (SODA’05)January 23–25, 2005Vancouver, BC, Canada1099
10Zhang Y CBao W SWang XFu X Q 2015 Chin. Phys. 24 110309
11Ambainis ABach ENayak AVishwanath AWatrous J2001Proceedings of the thirty-third Annual ACM Symposium on Theory of Computing (STOC’01)New York, USA37
12Childs A MFarhi EGutmann S 2002 Quantum Inf. Process. 1 35
13Tregenna BFlanagan WMaile RKendon V 2003 New J. Phys. 5 83
14Brun T ACarteret H AAmbainis A 2003 Phys. Rev. 67 052317
15Xue PSanders B C 2012 Phys. Rev. 85 022307
16Xue P 2013 J. Comput. Theor. Nanosci. 10 1606
17Mackay T DBartlett S DStephenson L TSanders B C 2002 J. Phys. A: Math. Gen. 35 2745
18Zhang RXue P 2014 Quantum Inf. Process. 13 1825
19Di Franco CMcGettrick MMachida TBusch T 2011 Phys. Rev. 84 042337
20Di Franco CMcGettrick MBusch Th 2011 Phys. Rev. Lett. 106 080502
21Zhang RXu Y QXue P 2015 Chin. Phys. 24 010303
22Qin HXue P 2016 Chin. Phys. 25 010501
23Li MZhang Y SGuo G C 2013 Chin. Phys. 22 030310
24Zhang RQin HTang BXue P 2013 Chin. Phys. 22 110312
25Do BStohler M LBalasubramanian SElliott D SEash CFischbach EFischbach M AMills AZwickl B 2005 J. Opt. Soc. Am. 22 499
26Schreiber ACassemiro K NPotoček VGábris AMosley P JAndersson EJex ISilberhorn C 2010 Phys. Rev. Lett. 104 050502
27Zhang PRen X FZou X BLiu B HHuang Y FGuo G C 2007 Phys. Rev. 75 052310
28Zhang PLiu B HLiu R FLi H RLi F LGuo G C 2010 Phys. Rev. 81 052322
29Xue PQin HTang BZhan XBian Z HLi J 2014 Chin. Phys. 23 110307
30Bian Z HLi JQin HZhan XZhang RSanders B CXue P 2015 Phys. Rev. Lett. 114 203602
31Xue PZhang RQin HZhan XBian Z HLi JSanders B C 2015 Phys. Rev. Lett. 114 140502
32Karski MFörster LChoi J MSteffen AAlt WMeschede DWidera A 2009 Science 325 174
33Schmitz HMatjeschk RSchneider CGlueckert JEnderlein MHuber TSchaetz T 2009 Phys. Rev. Lett. 103 090504
34Zähringer FKirchmair GGerritsma RSolano EBlatt RRoos C F 2010 Phys. Rev. Lett. 104 100503
35Du J FLi HXu X DShi M JWu J HZhou X YHan R D 2003 Phys. Rev. 67 042316
36Ryan C ALaforest MBoileau J CLaflamme R 2005 Phys. Rev. 72 062317
37Perets H BLahini YPozzi FSorel MMorandotti RSilberberg Y 2008 Phys. Rev. Lett. 100 170506
38Schreiber AGábris ARohde P PLaiho KStefanak MPotoček VHamilton CJex ISilberhorn C 2012 Science 336 55
39Qin HXue P 2014 Chin. Phys. 23 010301
40Bian Z HQin HZhan XLi JXue P 2016 Chin. Phys. 25 020307
41Norio K 2005 J. Math. Soc. Jpn. 57 1179
42Shiryaev A N2016Probability-13rd edn.New YorkSpringer-Verlag
43Luo HXue P 2015 Quantum Inf. Process. 14 4361
44Brun T ACarteret H AAmbainis A 2003 Phys. Rev. Lett. 91 130602